منابع مشابه
Inferring Finite Transducers
We consider the inference problem for finite transducers using different kinds of samples (positive and negative samples, positive samples only, and structural samples). Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs. We show that this problem can be solved in certain special cases by using known results on the inference problem...
متن کاملFinite-State Transducers
Finite-state transducers play an important role in natural language processing. They provide a model for text and speech, as well as transformations of them. In order to reduce the complexity of their application, deterministic and minimal transducers are required. This essay introduces a particular type of finite-state transducers, subsequential string-to-weight transducers, and presents algor...
متن کاملQuantum Finite State Transducers
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their ‘little brothers’, the quantum finite automata, the power of qfst is incomparable to that ...
متن کاملEquivalence of Finite-Valued Symbolic Finite Transducers
Symbolic Finite Transducers, or SFTs, is a representation of finite transducers that annotates transitions with logical formulas to denote sets of concrete transitions. This representation has practical advantages in applications for web security analysis, where it provides ways to succinctly represent web sanitizers that operate on large alphabets. More importantly, the representation is also ...
متن کاملChannel Synthesis for Finite Transducers
We investigate how two agents can communicate through a noisy medium modeled as a finite non deterministic transducer. The sender and the receiver are also described by finite transducers which can respectively encode and decode binary messages. When the communication is reliable, we call the encoder/decoder pair a channel. We study the channel synthesis problem which, given a transducer, asks ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2003
ISSN: 0104-6500
DOI: 10.1590/s0104-65002003000200001